Global Optimization Techniques for Mixed Complementarity Problems

نویسنده

  • Christian Kanzow
چکیده

We investigate the theoretical and numerical properties of two global optimization techniques for the solution of mixed complementarity problems. More precisely, using a standard semismooth Newton-type method as a basic solver for complementarity problems, we describe how the performance of this method can be improved by incorporating two wellknown global optimization algorithms, namely a tunneling and a filled function method. These methods are tested and compared with each other on a couple of very difficult test examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed quasi complementarity problems in topological vector spaces

In this paper, we introduce and consider a new class of complementarity problems, which are called the generalized mixed quasi-complementarity problems in a topological vector space. We show that the generalized mixed quasi-complementarity problems are equivalent to the generalized mixed quasi variational inequalities. Using a new type of KKM mapping theorem, we study the existence of a solutio...

متن کامل

Mathematical Programming Manuscript No. Feasible Descent Algorithms for Mixed Complementarity Problems

In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-deened for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This fram...

متن کامل

Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems

A reformulation of the mixed complementarity problem as a box constrained overdetermined system of semismooth equations or, equivalently, a box constrained nonlinear least squares problem with zero residual is presented. Based on this reformulation, a trust region method for the solution of mixed complementarity problems is considered. This trust region method contains elements from different a...

متن کامل

A Homotopy-Based Algorithm for Mixed Complementarity Problems

This paper develops an algorithm for solving mixed complementarity problems which is based upon probability one homotopy methods. After the complementarity problem is reformulated as a system of nonsmooth equations, a homotopy method is used to solve a sequence of smooth approximations to this system of equations. The global convergence properties of this approach are considerably stronger than...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Global Optimization

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2000